Factored Orthogonal Matrix-vector Multiplication with Applications to Parallel and Adaptive Eigennltering and Svd 1 Factored Orthogonal Matrix -vector Multiplication with Applications to Parallel and Adaptive Eigennltering and Svd

نویسندگان

  • Filiep Vanpoucke
  • Marc Moonen
  • Ed F. Deprettere
چکیده

A novel algorithm is presented for adaptive eigennltering and for updating the singular value decomposition (SVD). It is an improvement upon an earlier developed Jacobi-type SVD updating algorithm, where now the exact orthogonality of the matrix of singular vectors/eigenvectors is guaranteed by storing a minimal factorization. This orthogonality property is known to be crucial for the numerical stability of the overall algorithm. The factored approach leads to a triangular array of rotation cells, implementing an orthogonal matrix-vector multiplication, and a novel array for SVD updating. Both Filiep Vanpoucke is a research assistant of the Belgian N. 1 arrays can be built up of CORDIC processors since the algorithms make exclusive use of orthogonal planar transformations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Svd{updating Using Approximate Rotations

In this paper a parallel implementation of the SVD{updating algorithm using approximate rotations is presented. In its original form the SVD{updating algorithm had numerical problems if no reorthogonalization steps were applied. Representing the orthogonal matrix V (right singular vectors) using its parameterization in terms of the rotation angles of n(n?1)=2 plane rotations these reorthogonali...

متن کامل

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

Factored spherical subspace tracking

Tracking the dominant subspace of a measured data matrix is an essential part of many signal processing algorithms. We present a modiication to the so-called spherical subspace tracking algorithm. This algorithm has a low computational complexity, but suuers from accumulation of numerical errors. We show that this numerical instability can be circumvented by using a minimal orthogonal parameter...

متن کامل

Empirical Mode Decomposition based Adaptive Filtering for Orthogonal Frequency Division Multiplexing Channel Estimation

This paper presents an empirical mode decomposition (EMD) based adaptive filter (AF) for channel estimation in OFDM system.  In this method, length of channel impulse response (CIR) is first approximated using Akaike information criterion (AIC). Then, CIR is estimated using adaptive filter with EMD decomposed IMF of the received OFDM symbol. The correlation and kurtosis measures are used to sel...

متن کامل

Parallel Code for One-sided Jacobi-Method

One sided block Jacobi algorithm for the singular value decomposition (SVD) of matrix can be a method of choice to compute SVD efficiently and accurately in parallel. A given matrix is logically partitioned into block columns and is subjected to an iteration process. In each iteration step, for given two block columns, their Gram matrix is generated, its symmetric eigenvalue decomposition (EVD)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994